Generating Numerical Approximations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Numerical Approximations

We describe a computational model for planning phrases like “more than a quarter” and “25.9 per cent” which describe proportions at different levels of precision. The model lays out the key choices in planning a numerical description, using formal definitions of mathematical form (e.g., the distinction between fractions and percentages) and roundness adapted from earlier studies. The task is mo...

متن کامل

Theory and Numerical Approximations

We consider a nonlinear Dirac system in one space dimension with periodic boundary conditions. First, we discuss questions on the existence and uniqueness of the solution. Then, we propose an implicit-explicit finite difference method for its approximation, proving optimal order a priori error estimates in various discrete norms and showing results from numerical experiments.

متن کامل

Generating Numerical Literals During Refinement

Despite the rapid emergence and success of Inductive Logic Programming, problems still surround number handling|problems directly inherited from the choice of logic programs as the representation language. Our conjecture is that a generalisation of the representation language to Constraint Logic Programs provides an eeective solution to this problem. We support this claim with the presentation ...

متن کامل

Computing Inner Approximations of Numerical MaxCSP

Classically, inner-approximation techniques guarantee soundness over a conjunction of numerical non-linear constraints. These techniques do not offer obvious extensions to manage such problems as solving numerical MaxCSPs. In this paper, we present an algorithm to compute inner approximations of numerical MaxCSPs. Our approach guarantees a complete and sound exploration of the search space and ...

متن کامل

Piecewise-quadratic Approximations in Convex Numerical Optimization

We present a bundle method for convex nondifferentiable minimization where the model is a piecewise-quadratic convex approximation of the objective function. Unlike standard bundle approaches, the model only needs to support the objective function from below at a properly chosen (small) subset of points, as opposed to everywhere. We provide the convergence analysis for the algorithm, with a gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Linguistics

سال: 2012

ISSN: 0891-2017,1530-9312

DOI: 10.1162/coli_a_00086